Rank 3 Latin square designs
نویسندگان
چکیده
منابع مشابه
Rank 3 Latin square designs
A Latin square design whose automorphism group is transitive of rank at most 3 on points must come from the multiplication table of an elementary abelian p-group,
متن کاملLatin Square Type Bipartite Row-column Designs
A class of Balanced Bipartite Row-Column Designs (BBPRC-designs) in two sets of treatments of sizes v1=v and v2=v+1 with replications 2(v-1) and 2v, respectively, has been constructed by replacing the ii-th positions of 2v × 2v standard cyclic latin square design in 2v treatments by 2v treatments by (2v+1)-th treatment. Such design finds applications in agricultural and industrial experimentati...
متن کاملRandom Latin square graphs
In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic numbers, their expansion properties as well as their connectivity and Hamiltonicity. The results obtained are compared with other models of random graphs and seve...
متن کاملSliced Latin Hypercube Designs
This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...
متن کاملNested Latin hypercube designs
We propose an approach to constructing nested Latin hypercube designs. Such designs are useful for conducting multiple computer experiments with different levels of accuracy. A nested Latin hypercube design with two layers is defined to be a special Latin hypercube design that contains a smaller Latin hypercube design as a subset. Our method is easy to implement and can accommodate any number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2006
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2005.06.004